-
Notifications
You must be signed in to change notification settings - Fork 0
/
Year 38 - Seek and Destroy 3
221 lines (220 loc) · 2.59 KB
/
Year 38 - Seek and Destroy 3
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
-- 7 Billion Humans (2235) --
-- 38: Seek and Destroy 3 by @abfipes12 and @commonnickname --
-- failed 0 out of 425 => 100% successful --
mem1 = nearest datacube
mem2 = nearest worker
mem3 = nearest wall
step n
mem4 = nearest wall
if mem1 == 0:
pickup n
jump a
endif
step n
if mem3 != mem4:
mem3 = nearest wall
if mem3 != mem4:
step w
step n
step n
step n
step n
step n
step e
step w
pickup c
pickup c
pickup c
step e
step s
step s
step s
step s
step s
end
endif
endif
step n
mem4 = nearest datacube
if mem4 <= mem1:
if mem4 == 0:
a:
jump b
endif
mem1 = nearest datacube
endif
step n
mem4 = nearest datacube
if mem4 <= mem1:
if mem4 == 0:
b:
jump c
endif
mem1 = nearest datacube
endif
step n
mem4 = nearest datacube
if mem4 <= mem1:
if mem4 == 0:
c:
jump d
endif
mem1 = nearest datacube
endif
step n
mem4 = nearest datacube
if mem4 <= mem1:
if mem4 == 0:
d:
jump e
endif
mem1 = nearest datacube
endif
step n
mem4 = nearest datacube
if mem4 <= mem1:
if mem4 == 0:
e:
jump f
endif
mem1 = nearest datacube
endif
step n
mem4 = nearest datacube
if mem4 <= mem1:
if mem4 == 0:
f:
pickup mem4
jump g
endif
mem1 = nearest datacube
endif
if n <= mem1:
pickup n
if myitem == 0:
g:
jump h
endif
if myitem > 32:
jump i
endif
mem3 = nearest worker
else:
if mem1 > 32:
i:
jump j
endif
step mem1
mem3 = nearest worker
if mem1 >= mem2 or
mem1 >= mem3:
pickup c
j:
jump k
else:
pickup c
endif
endif
mem4 = nearest worker
if mem2 < myitem or
mem3 < myitem or
mem4 < myitem:
k:
jump l
endif
step w
mem1 = nearest worker
if mem2 < myitem or
mem4 < myitem or
mem3 < myitem or
mem1 < myitem:
l:
jump m
endif
step sw
mem3 = nearest worker
if mem2 < myitem or
mem4 < myitem or
mem1 < myitem or
mem3 < myitem:
m:
jump n
endif
step w
mem4 = nearest worker
if mem2 < myitem or
mem4 < myitem or
mem3 < myitem or
mem1 < myitem:
n:
o:
step ne
p:
jump o
endif
mem1 = nearest shredder
step mem1
mem3 = nearest worker
if mem3 < myitem or
mem2 < myitem or
mem4 < myitem:
q:
jump p
endif
if mem3 >= 0:
else:
h:
jump r
endif
step e
mem3 = nearest worker
if mem3 < myitem:
s:
jump q
endif
if mem3 >= 0:
else:
r:
jump t
endif
step s
mem3 = nearest worker
if mem3 < myitem:
u:
jump s
endif
if mem3 >= 0:
else:
t:
jump v
endif
step ne
mem3 = nearest worker
if mem3 < myitem:
w:
jump u
endif
if mem3 >= 0:
else:
v:
jump x
endif
step w
mem3 = nearest worker
if mem3 < myitem:
y:
jump w
endif
if mem3 >= 0:
else:
x:
jump z
endif
step w
mem3 = nearest worker
if mem3 < myitem:
jump y
endif
z:
mem2 = nearest shredder
giveto mem2